Toward constructive Slepian-Wolf coding schemes
نویسندگان
چکیده
This chapter deals with practical solutions for the Slepian Wolf (SW) coding problem, which refers to the problem of lossless compression of correlated sources with coders which do not communicate. Here, we will consider the case of two binary correlated sources X and Y , characterized by their joint distribution. If the two coders communicate, it is well known from Shannon’s theory that the minimum lossless rate for X and Y is given by the joint entropy H(X,Y ). Slepian and Wolf established in 1973 [30] that this lossless compression rate bound can be approached with a vanishing error probability for infinitely long sequences, even if the two sources are coded separately, provided that they are decoded jointly and that their correlation is known to both the encoder and the decoder. Hence, the challenge is to construct a set of encoders which do not communicate and a joint decoder which can achieve the theoretical limit. This chapter gives an overview of constructive solutions both for the asymmetric and the non asymmetric SW coding problems. Asymmetric SW coding refers to the case where one source, for example Y , is transmitted at its entropy rate and used as side information to decode the second source X. Non asymmetric SW coding refers to the case where both sources are compressed at a rate lower than their respective entropy rates. Sections 2 and 3 recall the principles and then describe practical schemes for asymmetric and symmetric coding respectively. Practical solutions for which the compression rate is a priori fixed according to the correlation between the two sources are first described. In this case, the correlation between the two sources needs to be known or estimated at the transmitter. Rate-adaptive schemes in which the SW code is incremental are then presented. This chapter ends with Section 4 covering various advanced SW coding topics such as the design of schemes based on source codes and the generalization to the case of non-binary sources, and to the case of M sources.
منابع مشابه
Universal Coding for Lossless and Lossy Complementary Delivery Problems
This paper deals with a coding problem called complementary delivery, where messages from two correlated sources are jointly encoded and each decoder reproduces one of two messages using the other message as the side information. Both lossless and lossy universal complementary delivery coding schemes are investigated. In the lossless case, it is demonstrated that a universal complementary deliv...
متن کاملMultiterminal Source Code Design Based on Slepian-Wolf coded quantization∗
Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. This paper presents two practical MT coding schemes under the same general framework of Slepian-Wolf coded quantization (SWCQ) for both direct and indirect quadratic Gaussian MT source coding problems with two encoders. The first asymmetric SWCQ scheme relies on quantization and...
متن کاملApproaching the Slepian-Wolf Limit with LDPC Coset Codes
We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...
متن کاملDistributed arithmetic coding for the Slepian-Wolf problem
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, named “distributed arithmetic coding”, which extends arithmetic codes to the distributed case employing sequential decoding aided by the side information. In particular, we introduce a distributed binary arithmetic coder for the Slepian-Wolf coding problem...
متن کاملDistributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic coding”, which exploits the fact that arithmetic codes are good source as well as channel codes. In particular, we propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along wit...
متن کامل